Inner and outer approximations of polytopes using boxes
نویسندگان
چکیده
منابع مشابه
Inner and outer approximations of polytopes using boxes
This paper deals with the problem of approximating a convex polytope in any finite dimension by a collection of (hyper)boxes. More exactly, given a polytope P by a system of linear inequalities, we look for two collections I and E of boxes with non-overlapping interiors such that the union of all boxes in I is contained in P and the union of all boxes in E contains P . We propose and test sever...
متن کاملSome lower bounds on sparse outer approximations of polytopes
Motivated by the need to better understand the properties of sparse cutting-planes used in mixed integer programming solvers, the paper [2] studied the idealized problem of how well a polytope is approximated by the use of sparse valid inequalities. As an extension to this work, we study the following “less idealized” questions in this paper: (1) Are there integer programs, such that sparse ine...
متن کاملInner and outer fuzzy approximations of confidence intervals
We extend the notion of confidence region to fuzzy data, by defining a pair of fuzzy inner and outer confidence regions. We show the connection with previous proposals, as well as with recent studies on hypothesis testing with low quality data. © 2010 Elsevier B.V. All rights reserved.
متن کاملInner and Outer Approximations of Existentially Quantified Equality Constraints
We propose a branch and prune algorithm that is able to compute inner and outer approximations of the solution set of an existentially quantified constraint where existential parameters are shared between several equations. While other techniques that handle such constraints need some preliminary formal simplification of the problem or only work on simpler special cases, our algorithm is the fi...
متن کاملInformation-theoretic approximations of polytopes
Common information was introduced by Wyner [1975] as a measure of dependence of two random variables. This measure has been recently resurrected as a lower bound on the logarithm of the nonnegative rank of a nonnegative matrix in Jain et al. [2013], Braun and Pokutta [2013]. Lower bounds on nonnegative rank have important applications to several areas such as communication complexity and combin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2004
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(03)00048-8